Partitioning a rectangle into small perimeter rectangles
نویسندگان
چکیده
Alon, N. and D.J. Kleitman, Partitioning a rectangle into small perimeter rectangles, Discrete Mathematics 103 (1992) 111-119. We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k 1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having the same perimeter. We also consider the analogous problem for partitioning a rectangle into n rectangles and describe some possible approaches to it.
منابع مشابه
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
We solve the problem of decomposing a rectangle R into p rectangles of equal area so that the maximum rectangle perimeter is as small as possible. This work has applications in areas such as flexible object packing and data allocation. Our solution requires only a constant number of arithmetic operations and integer square roots to characterize the decomposition, and linear time to print the de...
متن کاملPartitioning orthogonal polygons into fat rectangles in polynomial time
We provide a polynomial-time algorithm to partition an orthogonal polygon of n vertices into isothetic rectangles so that the shortest rectangle side is maximized over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat.”
متن کاملMaximising Neumann eigenvalues on rectangles
We obtain results for the spectral optimisation of Neumann eigenvalues on rectangles in R with a measure or perimeter constraint. We show that the rectangle with measure 1 which maximises the k’th Neumann eigenvalue converges to the unit square in the Hausdorff metric as k → ∞. Furthermore, we determine the unique maximiser of the k’th Neumann eigenvalue on a rectangle with given perimeter. AMS...
متن کاملFinding largest rectangles in convex polygons
We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with n vertices. We give exact algorithms that solve these problems in time O(n). We also give (1 − ε)-approximation algorithms that take time O(ε−3/2 + ε−1/2 log n) for maximizing the area and O(ε−3 + ε−1 log n) for maximizing the perimeter.
متن کاملSymmetry-Based Search Space Reduction For Grid Maps
In this paper we explore a symmetry-based search space reduction technique which can speed up optimal pathfinding on undirected uniform-cost grid maps by up to 38 times. Our technique decomposes grid maps into a set of empty rectangles, removing from each rectangle all interior nodes and possibly some from along the perimeter. We then add a series of macro-edges between selected pairs of remain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 103 شماره
صفحات -
تاریخ انتشار 1992